Theorem Provers as Question Answerers
نویسنده
چکیده
T h i s paper d e s c r i b e s a d e d u c t i v e q u e s t i o n a n s w e r i n g comp u t e r program t h a t uses the Robinson r e s o l u t i o n p rocedu re t o p e r f o r m l o g i c a l i n f e r e n c e s and r e t r i e v e f a c t s o n the b a s i s o f a f a i r l y l a r g e body o f s t o r e d d a t a . I r r e l e v a n t searches and i n f e r e n c e s a r e k e p t to a minimum by means of some r e c e n t l y deve loped t h e o r e m p r o v i n g t e c h n i q u e s , most n o t a b l y M e l t z e r ' s P l d e d u c t i o n w i t h s e t o f s u p p o r t 1 and the ' f i r s t l i t e r a l r e s o l u t i o n ' method o f Hayes and K o w a l s k i , t o g e t h e r w i t h a d i c t i o n a r y l i s t i n g o f t he p remises i n t h e da ta base i n te rms o f t he p r e d i c a t e s and o t h e r key c o n s t a n t s o f t h e i r f i r s t l i t e r a l s . Us ing the s p e c i a l p r e d i c a t e Var o f Green and R a p h a e l , t h e program can hand le q u e s t i o n s r e q u i r i n g a l i s t o f answers , such as ' w h i c h (o r how many) i n d i v i d u a l s s a t i s f y a c o n d i t i o n 0 ? f , as well as simpler questions requiring a single answer, such as ' is individual a_ a 0?' In a series of tests using a data base containing the names and party a f f i l i ations of the senators, congressmen and governors of the f i f t y American states, the program has shown the abi l i ty to perform fair ly complex deductions eff iciently in the presence of a large number of irrelevant premises.
منابع مشابه
Effective Question Recommendation Based on Multiple Features for Question Answering Communities
We propose a new method of recommending questions to answerers so as to suit the answerers’ knowledge and interests in User-Interactive Question Answering (QA) communities. A question recommender can help answerers select the questions that interest them. This increases the number of answers, which will activate QA communities. An effective question recommender should satisfy the following thre...
متن کاملReasoning Support for Expressive Ontology Languages Using a Theorem Prover
It is claimed in [45] that first-order theorem provers are not efficient for reasoning with ontologies based on description logics compared to specialised description logic reasoners. However, the development of more expressive ontology languages requires the use of theorem provers able to reason with full first-order logic and even its extensions. So far, theorem provers have extensively been ...
متن کاملModeling Answerer Behavior in Collaborative Question Answering Systems
A key functionality in Collaborative Question Answering (CQA) systems is the assignment of the questions from information seekers to the potential answerers. An attractive solution is to automatically recommend the questions to the potential answerers with expertise or interest in the question topic. However, previous work has largely ignored a key problem in question recommendation namely, whe...
متن کاملMeasuring the effectiveness of answers in Yahoo! Answers
Purpose – This study investigates the ways in which effectiveness of answers in Yahoo! Answers, one of the largest community question answering sites (CQAs), is related to question types and answerer reputation. Effective answers are defined as those that are detailed, readable, superior in quality, and contributed promptly. Five question types that were studied include factoid, list, definitio...
متن کاملTheorem Provers Survey
Theorem provers are computer programs capable of nding proofs for theorems within mathematical theories. Theorem provers have been an important part of the computer science eld. The birth of theorem provers could be traced to the 50's with the introduction of the electronic computer to the universities. This paper presents the actual classiication of theorem provers, and present an evaluation o...
متن کاملA Bayesian Technique for Estimating the Credibility of question Answerers
We address the problem of ranking question answerers according to their credibility, characterized here by the probability that a given question answerer (user) will be awarded a best answer on a question given the answerer’s question-answering history. This probability (represented by θ ) is considered to be a hidden variable that can only be estimated statistically from specific observations ...
متن کامل